Cardinality constrained minimum cut problems: complexity and algorithms
نویسندگان
چکیده
منابع مشابه
Some Complexity Results for k-Cardinality Minimum Cut Problems
Many polynomially solvable combinatorial optimization problems (COP) become NP hard when we require solutions to satisfy an additional cardinality constraint. This family of problems has been considered only recently. We study a new problem of this family: the k-cardinality minimum cut problem. Given an undirected edge-weighted graph the k-cardinality minimum cut problem is to nd a partition of...
متن کاملCardinality constrained and multicriteria (multi)cut problems
In this paper, we consider multicriteria and cardinality constrained multicut problems. Let G be a graph where each edge is weighted by R positive costs corresponding to R criteria and consider k source-sink pairs of vertices of G and R integers B1, . . . , BR. The problem R-CriMultiCut consists in finding a set of edges whose removal leaves no path between the ith source and the ith sink for e...
متن کاملParameterized Complexity of Cardinality Constrained Optimization Problems
We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around 20 such optimization problems, as well as their parametric duals, that deal with various fundamental relations among vertices and edges in graphs....
متن کاملCardinality constrained combinatorial optimization: Complexity and polyhedra
Given a combinatorial optimization problem and a subset N of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of N . In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constra...
متن کاملPractical Minimum Cut Algorithms
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00358-5